/**
 * #      971
 * 名称   翻转二叉树以匹配先序遍历
 * 链接   https://leetcode-cn.com/problems/flip-binary-tree-to-match-preorder-traversal
 * 题解   [75](https://leetcode-cn.com/problems/flip-binary-tree-to-match-preorder-traversal/solution)
 * 通过率 43.9%
 * 难道   中等
 */

